A Dilation of Transfer Matrices with Infinite and Finite Imaginary Axis Zeros
نویسنده
چکیده
For a non-square transfer matrix with zeros on the extended imaginary axis including infinity, this paper discusses how to dilate (augment) such transfer matrix to a square one without adding extra zeros on the extended imaginary axis. The state-space construction for the dilation is proposed by using the finite and infinite eigenstructures of the transfer matrix. Copyright c © 2002 IFAC
منابع مشابه
Spectral Factorization With Imaginary-Axis Zeros*
We examine the problem of the existence and calculation of Hermitian solutions P of a linear matrix inequality corresponding to the spectral factorization of a proper rational spectral density. In particular, zeros are permitted on the finite imaginary axis or at infinity. As part of our construction of solutions, we show explicitly that each such imaginary-axis eigenvalue, either finite or inf...
متن کاملAlgorithm of J-factorization of Rational Matrices with Zeros and Poles on the Imaginary Axis
The problem of J-factorization of rational matrices, which have zeros and poles on the imaginary axis, is reduced to construction of the solutions of two algebraic Riccati equations. For construction of these solutions, it is offered to use appropriate algorithms. These algorithms permit to find the solutions in cases when the Hamiltonian matrices, which are corresponding to these equations, ha...
متن کاملDistribution of Lee-Yang zeros and Griffiths singularities in the ±J model of spin glasses
We investigate the distribution of zeros of the partition function of the twoand three-dimensional symmetric ±J Ising spin glasses on the complex field plane. We use the method to analytically implement the idea of numerical transfer matrix which provides us with the exact expression of the partition function as a polynomial of fugacity. The results show that zeros are distributed in a wide reg...
متن کاملA Toeplitz algorithm for polynomial J-spectral factorization
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can have zeros along the imaginary axis. The key assumption is that the finite zeros of the input polynomial matrix are given as input data. The algorithm is based on numerically reliable operations only, namely computation ...
متن کاملComputation of general inner-outer and spectral factorizations
In this paper we solve two problems in linear systems theory: the computation of the inner–outer and spectral factorizations of a continuous–time system considered in the most general setting. We show that these factorization problems rely essentially on solving for the stabilizing solution a standard algebraic Riccati equation of order usually much smaller than the McMillan degree of the trans...
متن کامل